Optimal Gray-code labeling and recognition algorithms for hypercubes
نویسندگان
چکیده
منابع مشابه
Optimal Gray-code labeling and recognition algorithms for hypercubes
We present an optimal greedy algorithm which returns a Gray-code labeling of the nodes of an n-dimensional hypercube; that is, a labeling of the nodes with binary strings of length n for which the Hamming distance between two nodes is 1 if and only if these are adjacent in the hypercube. The proposed algorithm is very simple; it uses breadth-®rst search to guide the greedy choice of nodes and c...
متن کاملOptimal Communication Algorithms for Hypercubes
We consider the following basic communication problems in a hypercube network of processors: the problem of a single processor sending a different packet to each of the other processors, the problem of simultaneous broadcast of the same packet from every processor to all other processors, and the problem of simultaneous exchange of different packets between every pair of processors. The algorit...
متن کاملRouting and Broadcasting on Incomplete and Gray Code Incomplete Hypercubes
We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal d...
متن کاملRecap: Consistent-labeling and Hypercubes
Universes. In many cases, it is probably more convenient or even crucial to work with an abstract universe, rather than a collection of Boolean hypercubes. Suppose we are given an abstract universe A = ⊎ eAe, where the subuniverses all have the same size. Like before, we want the property that unless both sets in a complement pair are picked, picking a large number of sets still won’t cover the...
متن کاملLoop-Free Gray Code Algorithms for the Set of Compositions
The topic of Gray codes for the set of compositions with non-negative integer parts has been studied by several authors. Klingsberg gave a non-recursive description of a Gray code for this set after the recursive version of Knuth. Recently, Walsh modified Klingsberg’s algorithm to find a Gray code which generates the set of all bounded compositions with non-negative integer parts. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2001
ISSN: 0020-0255
DOI: 10.1016/s0020-0255(01)00120-7